Multiple Space Filter Design
نویسندگان
چکیده
This paper presents a general approach for obtaining optimal filters as well as filter sequences. A filter is termed optimal when it minimizes a chosen distance measure with respect to an ideal filter. The method allows specification of the metric via simultaneous weighting functions in multiple domains, e.g. the spatio-temporal space and the Fourier space. It is shown how convolution kernels for efficient spatiotemporal filtering can be implemented in practical situations. The method is based on applying a set of jointly optimized filter kernels in sequence. The optimization of sequential filters is performed using a novel recursive optimization technique. A number of optimization examples are given that demonstrate the role of key parameters such as: number of kernel coefficients, number of filters in sequence, spatio-temporal and Fourier space metrics. In multidimensional filtering applications the method potentially outperforms both standard convolution and FFT based approaches by 2-digit numbers.
منابع مشابه
A comprehensive benchmark between two filter-based multiple-point simulation algorithms
Computer graphics offer various gadgets to enhance the reconstruction of high-order statistics that are not correctly addressed by the two-point statistics approaches. Almost all the newly developed multiple-point geostatistics (MPS) algorithms, to some extent, adapt these techniques to increase the simulation accuracy and efficiency. In this work, a scrutiny comparison between our recently dev...
متن کاملDesign of IIR Digital Filter using Modified Chaotic Orthogonal Imperialist Competitive Algorithm (RESEARCH NOTE)
There are two types of digital filters including Infinite Impulse Response (IIR) and Finite Impulse Response (FIR). IIR filters attract more attention as they can decrease the filter order significantly compared to FIR filters. Owing to multi-modal error surface, simple powerful optimization techniques should be utilized in designing IIR digital filters to avoid local minimum. Imperialist compe...
متن کاملAn Efficient LUT Design on FPGA for Memory-Based Multiplication
An efficient Lookup Table (LUT) design for memory-based multiplier is proposed. This multiplier can be preferred in DSP computation where one of the inputs, which is filter coefficient to the multiplier, is fixed. In this design, all possible product terms of input multiplicand with the fixed coefficient are stored directly in memory. In contrast to an earlier proposition Odd Multiple Storage ...
متن کاملProbability Hypothesis Density Filter Based Design Concept: A Survey for Space Traffic Modeling and Control
The Probability Hypothesis Density (PHD) filter has been recently received a lot of attention by the estimation and data fusion community for its ability to provide a useful solution to the Bayesian filter problem (i.e., implementation issue). Its core foundation to other parallel directions, such as the Sequential Monte Carlo PHD, the Gaussian Mixture PHD and others, offers a viable path to pr...
متن کاملMatched Filter Bound for Space-Time Block Coded MIMO Systems in Correlated Multipath Fading
The matched filter bound for space-time block coded multiple-input multiple-output systems in a frequency-selective Nakagami fading channel is derived for binary phase shift keying. Arbitrary correlation among the elements of the transmitter and the receiver antenna arrays is taken into account. Moreover, in the special case of Rayleigh fading the effect of the pulse shape is also considered. T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998